My route to arithmetization
نویسنده
چکیده
I had the pleasure of renewing my acquaintance with Per Lindström at the meeting of the Seventh Scandinavian Logic Symposium, held in Uppsala in August 1996. There at lunch one day, Per said he had long been curious about the development of some of the ideas in my paper [1960] on the arithmetization of metamathematics. In particular, I had used the construction of a non-standard definition !* of the set of axioms of P (Peano Arithmetic) to
منابع مشابه
From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry
This paper describes the formalization of the arithmetization of Euclidean geometry in the Coq proof assistant. As a basis for this work, Tarski’s system of geometry was chosen for its well-known metamathematical properties. This work completes our formalization of the two-dimensional results contained in part one of [SST83]. We defined the arithmetic operations geometrically and proved that th...
متن کاملUndecidability without Arithmetization
In the present paper the well-known Gbdel's Church's argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interesting. The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions ar...
متن کاملΩ-Arithmetization of Ellipses
Multi-resolution analysis and numerical precision problems are very important subjects in fields like image analysis or geometrical modeling. In the continuation of our previous works, we propose to apply the method of Ω-arithmetization to ellipses. We obtain a discrete multi-resolution representation of arcs of ellipses. The corresponding algorithms are completely constructive and thus, can be...
متن کاملShorter arithmetization of nondeterministic computations
Arithmetizing computation is a crucial component of many fundamental results in complexity theory, including results that gave insight into the power of interactive proofs, multi-prover interactive proofs, and probabilistically-checkable proofs. Informally, an arithmetization is a way to encode a machine’s computation so that its correctness can be easily verified via few probabilistic algebrai...
متن کاملUndecidability and Concatenation
We consider the problem stated by Andrzej Grzegorczyk in “Undecidability without arithmetization” (Studia Logica 79(2005)) whether certain weak theory of concatenation is essentially undecidable. We give a positive answer for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997